منابع مشابه
Faster deterministic Feedback Vertex Set
We present two new deterministic algorithms for the Feedback Vertex Set problem parameterized by the solution size. We begin with a simple algorithm, which runs in O((2 + φ)) time, where φ < 1.619 is the golden ratio. It already surpasses the previously fastest O((1+ 2 √ 2))-time deterministic algorithm due to Cao et al. [SWAT 2010]. In our developments we follow the approach of Cao et al., how...
متن کاملDeterministic Algorithms for the Independent Feedback Vertex Set Problem
A feedback vertex set F of an undirected graph G is a vertex subset of G whose removal results in a forest. Such a set F is said to be independent if F forms an independent set of G. In this paper, we study the problem of finding an independent feedback vertex set of a given graph with the minimum number of vertices, from the viewpoint of graph classes. This problem is NP-hard even for planar b...
متن کامل9.2 Minimum Feedback Vertex Set
Roughly speaking, the local ratio method works iteratively, and in each iteration it breaks a suitable structure (the local structure) to solve from the residual structure in that iteration. Typically the local structure is an instance that is very easy to solve. The main claim that is required is that the solution to the local structure can be patched with the solution from the next iteration,...
متن کاملFaster Exact and Parameterized Algorithm for Feedback Vertex Set in Bipartite Tournaments
A bipartite tournament is a directed graph T := (A ∪ B,E) such that every pair of vertices (a, b), a ∈ A, b ∈ B are connected by an arc, and no arc connects two vertices of A or two vertices of B. A feedback vertex set is a set S of vertices in T such that T − S is acyclic. In this article we consider the Feedback Vertex Set problem in bipartite tournaments. Here the input is a bipartite tourna...
متن کاملFaster Exact and Parameterized Algorithm for Feedback Vertex Set in Tournaments
A tournament is a directed graph T such that every pair of vertices is connected by an arc. A feedback vertex set is a set S of vertices in T such that T −S is acyclic. In this article we consider the Feedback Vertex Set problem in tournaments. Here the input is a tournament T and an integer k, and the task is to determine whether T has a feedback vertex set of size at most k. We give a new alg...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Information Processing Letters
سال: 2014
ISSN: 0020-0190
DOI: 10.1016/j.ipl.2014.05.001